Equivalence of lower bounds on the number of perfect pairs
نویسندگان
چکیده
Let c(F) be the number of perfect pairs of F and c(G) be the maximum of c(F) over all (near-) one-factorizations F of G. Wagner showed that for odd n, c(Kn) ≥ n∗φ(n) 2 and for m and n which are odd and co-prime to each other, c(Kmn) ≥ 2 ∗ c(Km) ∗ c(Kn). In this note, we establish that both these results are equivalent in the sense that they both give rise to the same lower bound.
منابع مشابه
On the Eccentric Connectivity Index of Unicyclic Graphs
In this paper, we obtain the upper and lower bounds on the eccen- tricity connectivity index of unicyclic graphs with perfect matchings. Also we give some lower bounds on the eccentric connectivity index of unicyclic graphs with given matching numbers.
متن کاملLower bounds on the signed (total) $k$-domination number
Let $G$ be a graph with vertex set $V(G)$. For any integer $kge 1$, a signed (total) $k$-dominating functionis a function $f: V(G) rightarrow { -1, 1}$ satisfying $sum_{xin N[v]}f(x)ge k$ ($sum_{xin N(v)}f(x)ge k$)for every $vin V(G)$, where $N(v)$ is the neighborhood of $v$ and $N[v]=N(v)cup{v}$. The minimum of the values$sum_{vin V(G)}f(v)$, taken over all signed (total) $k$-dominating functi...
متن کاملBounds for Robust Metering Schemes and Their Relationship with A2-code
A metering scheme allows a correct counting on the number of hits that a Web site received during a certain period. In this paper, we first derive tight lower bounds on the communication complexity |Vi| (i = 1, . . . , n) and the size of server’s secrets |Es| for robust and perfect (k, n)-metering schemes. We next show an almost equivalence between (k, n)-metering schemes and k-multiple-use A-c...
متن کاملBounds for Robust Metering Schemes and Their Relationship with A-code
A metering scheme allows a correct counting on the number of hits that a Web site received during a certain period. In this paper, we first derive tight lower bounds on the communication complexity |Vi| (i = 1, . . . , n) and the size of server’s secrets |Es| for robust and perfect (k, n)-metering schemes. We next show an almost equivalence between (k, n)-metering schemes and k-multiple-use A-c...
متن کاملON THE CHARACTERISTIC DEGREE OF FINITE GROUPS
In this article we introduce and study the concept of characteristic degree of a subgroup in a finite group. We define the characteristic degree of a subgroup H in a finite group G as the ratio of the number of all pairs (h,α) ∈ H×Aut(G) such that h^α∈H, by the order of H × Aut(G), where Aut(G) is the automorphisms group of G. This quantity measures the probability that H can be characteristic ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1412.6793 شماره
صفحات -
تاریخ انتشار 2014